Polarity graphs revisited
نویسندگان
چکیده
منابع مشابه
Wiener Polarity Index of Tensor Product of Graphs
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
متن کاملPolarity particles revisited
Claus, Meijer, Repp, and Krifka (2017) present novel experimental evidence concerning polarity particle responses in German, and discuss the challenges these findings raise for three approaches to such responses, namely the saliency account in Krifka (2013), the feature model in Roelofsen and Farkas (2015) (henceforth R&F), and the ellipsis approaches in Kramer and Rawlins (2012), Holmberg (201...
متن کاملPolarity of chordal graphs
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to decide for general graphs. It has been recently proved that for cographs, the existence of such a partition can be characterized by finitely many forbidden subgraphs, and hence tested in polynomial time. In this paper ...
متن کاملIndependent Sets in Polarity Graphs
Given a projective plane Σ and a polarity θ of Σ, the corresponding polarity graph is the graph whose vertices are the points of Σ, and two distinct points p1 and p2 are adjacent if p1 is incident to p θ 2 in Σ. A well-known example of a polarity graph is the Erdős-Rényi orthogonal polarity graph ERq, which appears frequently in a variety of extremal problems. Eigenvalue methods provide an uppe...
متن کاملOrientation distance graphs revisited
The orientation distance graph Do(G) of a graph G is defined as the graph whose vertex set is the pair-wise non-isomorphic orientations of G, and two orientations are adjacent iff the reversal of one edge in one orientation produces the other. Orientation distance graphs was introduced by Chartrand et al. in 2001. We provide new results about orientation distance graphs and simpler proofs to ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2014
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.527.74e